package 树;

public class Demo02 {
    /*
    * 深度优先搜索
    * */
    static class Solution {
        public boolean isSameTree(TreeNode p, TreeNode q) {
            if (p == null && q == null) {
                return true;
            }

            if (p == null || q == null) {
                return false;
            }

            if (p.val != q.val) {
                return false;
            }
            return isSameTree(p.left, q.left) && isSameTree(p.right, q.right);
        }
    }
    /*
    * 广度优先搜索,借助栈,代码有点长啊! 算了
    * */
}
